Compositional dependability modeling using arcade

Dependability is a key concern for today's complex computer and communication systems. To make sure that such an application meets all its dependability requirements, a rigorous and systematic analysis is required. This talk introduces ARCADE, a formally well-rooted and extensible framework for dependability evaluation. It has been designed so as to combine the strengths of previous approaches to the evaluation of dependability. Key feature is its formal semantics in terms of Input/Output-Interactive Markov Chains, which enables both compositional modeling and compositional analysis, enabling great computational reductions for many models. The ARCADE approach is also extensible, and hence adaptable to new circumstances or application areas. In this talk, I will introduce the new modeling approach, discuss its formal semantics and illustrate its use with two case studie

Efficiënt zoeken in grote tekstbestanden

Google, Twitter, en Facebook doorzoeken in een mum van tijd miljarden tekstdocumenten: google je "wiskunde", dan krijg je zo’n 4 miljoen resultaten binnen 0,1 seconde. Hoe doen applicaties als Google, Twitter en Facebook dit? Binnen de Informatica zijn een aantal slimme methoden (ook wel algoritmen genoemd) ontwikkeld om snel te zoeken in tekstbestanden. Deze methoden zijn gebaseerd op zogenaamde eindige automaten: een speciaal soort grafen waarvan de pijlen gelabeld zijn met letters van het te zoeken woord. Dit artikel doet verslag van een tweetal gastlessen in het middelbaar onderwijs omtrent deze zoekmethoden

Confluence reduction for Markov automata (extended version)

Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models generated by such specifications. We therefore introduce confluence reduction for Markov automata, a powerful reduction technique to keep these models small. We define the notion of confluence directly on Markov automata, and discuss how to syntactically detect confluence on the MAPA language as well. That way, Markov automata generated by MAPA specifications can be reduced on-the-fly while preserving divergence-sensitive branching bisimulation. Three case studies demonstrate the significance of our approach, with reductions in analysis time up to an order of magnitude

Smart railroad maintenance engineering with stochastic model checking

RAMS (reliability, availability, maintenance and safety) requirements are of utmost important for safety-critical systems like railroad infrastructure and signaling systems. Fault tree analysis (FTA) is a widely applied industry standard for RAMS analysis and is often one of the techniques preferred by railways organizations. FTA yields system availability and reliability, and can be used for critical path analysis. It can however not yet deal with a pressing aspect of railroad engineering: maintenance. While railroad infrastructure providers are focusing more and more on managing cost/performance ratios, RAMS can be considered as the performance specification, and maintenance the main cost driver. Methods facilitating the management of this ratio are still very uncommon. This paper presents a powerful, flexible and transparent technique to incorporate maintenance aspects in fault tree analysis, based on stochastic model checking. The analysis and comparison of different maintenance strategies (such as age-based, clockbased and condition-dependent maintenance) and their impact on reliability and availability metrics are thus enabled. Thus, the trade off between cost and RAMS performance is facilitated. To keep the underlying state space small, two aggressive state space reduction techniques are employed namely: compositional aggregation and smart semantics. The approach presented is illustrated using several existing, large fault tree models in a case study from Movares, a major RAMS consultancy firm in the Netherlands

Game Refinement Relations and Metrics

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal, for example, reach a target state, the question of winning is thus a probabilistic one: what is the maximal probability of winning from a given state? On these game structures, two fundamental notions are those of equivalences and metrics. Given a set of winning conditions, two states are equivalent if the players can win the same games with the same probability from both states. Metrics provide a bound on the difference in the probabilities of winning across states, capturing a quantitative notion of state similarity. We introduce equivalences and metrics for two-player game structures, and we show that they characterize the difference in probability of winning games whose goals are expressed in the quantitative mu-calculus. The quantitative mu-calculus can express a large set of goals, including reachability, safety, and omega-regular properties. Thus, we claim that our relations and metrics provide the canonical extensions to games, of the classical notion of bisimulation for transition systems. We develop our results both for equivalences and metrics, which generalize bisimulation, and for asymmetrical versions, which generalize simulation

DFTCalc: a tool for efficient fault tree analysis (extended version)

Effective risk management is a key to ensure that our nuclear power plants, medical equipment, and power grids are dependable; and is often required by law. Fault Tree Analysis (FTA) is a widely used methodology here, computing important dependability measures like system reliability. This paper presents DFTCalc, a powerful tool for FTA, providing (1) efficient fault tree modelling via compact representations; (2) effective analysis, allowing a wide range of dependability properties to be analysed (3) efficient analysis, via state-of-the-art stochastic techniques; and (4) a flexible and extensible framework, where gates can easily be changed or added. Technically, DFTCalc is realised via stochastic model checking, an innovative technique offering a wide plethora of pow- erful analysis techniques, including aggressive compression techniques to keep the underlying state space small